Finding efficient recursions for risk aggregation by computer algebra
نویسندگان
چکیده
We derive recursions for the probability distribution of random sums by computer algebra. Unlike the well-known Panjer-type recursions, they are of finite order and thus allow for computation in linear time. This efficiency is bought by the assumption that the probability generating function of the claim size be algebraic. The probability generating function of the claim number is supposed to be from the rather general class of D-finite functions. c © 2008 Elsevier B.V. All rights reserved. MSC: primary 91B30; secondary 68W30
منابع مشابه
General models of multilocus evolution.
In 1991, Barton and Turelli developed recursions to describe the evolution of multilocus systems under arbitrary forms of selection. This article generalizes their approach to allow for arbitrary modes of inheritance, including diploidy, polyploidy, sex linkage, cytoplasmic inheritance, and genomic imprinting. The framework is also extended to allow for other deterministic evolutionary forces, ...
متن کاملImproving the Inference of Gene Expression Regulatory Networks with Data Aggregation Approach
Introduction: The major issue for the future of bioinformatics is the design of tools to determine the functions and all products of single-cell genes. This requires the integration of different biological disciplines as well as sophisticated mathematical and statistical tools. This study revealed that data mining techniques can be used to develop models for diagnosing high-risk or low-risk lif...
متن کاملImproving the Inference of Gene Expression Regulatory Networks with Data Aggregation Approach
Introduction: The major issue for the future of bioinformatics is the design of tools to determine the functions and all products of single-cell genes. This requires the integration of different biological disciplines as well as sophisticated mathematical and statistical tools. This study revealed that data mining techniques can be used to develop models for diagnosing high-risk or low-risk lif...
متن کاملOn Sampling Rates in Stochastic Recursions
We consider the context of “stochastic recursions,” that is, recursions that involve quantities needing to be estimated using a stochastic simulation. Examples include certain stochastic adaptations of fixed-point recursions, line search recursions, and trust-region recursions obtained by replacing function and derivative values appearing within the recursion by their Monte Carlo counterparts. ...
متن کاملAlgebraic Recurrence Transformations for Massive Parallelism
If an algorithm needs to he implemented for a high-speed application, a recursive loop is often found to he a bottleneck. Therefore, for some practical examples much work has been done so far to show how to transform single-step recursions into M-step recursions using socalled “look-ahead computations.” In this paper, we show that certain algebraic structures are sufficient for the operations o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007